Time-Space Trade-Offs for the Longest Common Substring Problem Tatiana Starikovskaya1 and Hjalte Wedel Vildhøj2 1 Moscow State University, Department of Mechanics and Mathematics,

Source URL: www.hwv.dk

The Problem of Substance Use and TBI Who is at risk for developing a substance abuse problem after TBI? How many people who have traumatic brain injuries are intoxicated at the time of injury? How common is a history of

Source URL: www.biaia.org

PDF Document

Source URL: www.math.stevens.edu

• Theory of computation
• Computational complexity theory
• Theoretical computer science
• Computability theory
• Analysis of algorithms
• Complexity classes
• Generic-case complexity
• Halting problem
• Time complexity
• Algorithm
• NP
• Randomized algorithm

A CASE STUDY: Halliburton integration solves problem and saves money for customer. Halliburton provides optimization of stimulation fluids in real time using distributed temperature sensing with coiled tubing. OV E RV I

Source URL: www.halliburton.com

Problem of the Week Problem B When Do We Eat? Laura is attending a wedding at which 300 guests are present. The guests begin to leave the celebration at 9:00 p.m., 20 at a time, and thereafter, groups of 20 guests leave

Source URL: cemc.uwaterloo.ca

Our multi-system moral psychology: Towards a consensus view Fiery Cushman, Liane Young, and Joshua D. Greene Introduction In the field of moral psychology, a number of theoretical proposals that were at one time regarded

Source URL: cushmanlab.fas.harvard.edu

• Morality
• Social psychology
• Normative ethics
• Meta-ethics
• Moral psychology
• Trolley problem
• Deontological ethics
• Empathy
• Disgust
• Philosophy
• Ethics
• Behavior

Use case 1: Stopped-meters Problem definition: A stopped-meter is a meter that reports zero during a predefined period of time. The zero report can occur for two reasons: either the meter is faulty or else there is legit

Source URL: research.ibm.com

c 2005 Society for Industrial and Applied Mathematics  SIAM J. COMPUT. Vol. 34, No. 6, pp. 1331–1351

Source URL: www.cims.nyu.edu

• Analysis of algorithms
• NP-complete problems
• Set cover problem
• Randomized algorithm
• Time complexity
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Improved Bound for the Union of Fat Triangles∗ Esther Ezra† Boris Aronov‡ Abstract

Source URL: www.cims.nyu.edu

• Analysis of algorithms
• Computational geometry
• NP-complete problems
• Ε-net
• Time complexity
• Set cover problem
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

LNCSCircle of Friend Query in Geo-Social Networks

Source URL: www.cse.unt.edu

• Search algorithms
• Approximation algorithms
• Mathematical optimization
• NP-complete problems
• Analysis of algorithms
• Nearest neighbor search
• Clique problem
• K-nearest neighbor algorithm
• Time complexity
• Theoretical computer science
• Mathematics
• Applied mathematics